A Service-Clustering-based Dynamic Scheduling Algorithm for Grid Tasks
نویسندگان
چکیده
Task scheduling in Grid environment is a challenging problem because of NP-complete nature of scheduling issue and dynamic characteristic of the environment. Not constrained by local scheduling policy of Grid site, a dynamic service evaluation method based on cloud model is presented. Then we obtain performance metrics of dynamic service. According to dynamic service evaluation, an adaptive and dynamic service clustering method is derived from PSO (Particle Swarm Optimization)-based clustering algorithm. It gathers the services with similar or same QoS (Quality of Service) into one cluster. A dynamic meta-task scheduling algorithm is proposed in light of service clustering. We conduct extensive experiments on the implemented prototype. The results show that our algorithm outperforms prior well-established algorithms in terms of time complexity and user QoS guarantee.
منابع مشابه
Dynamic Replication based on Firefly Algorithm in Data Grid
In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...
متن کاملGreen Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملSpectral Clustering Scheduling Techniques for Tasks with Strict QoS Requirements
Efficient task scheduling is fundamental for the success of the Grids, since it directly affects the Quality of Service (QoS) offered to the users. Efficient scheduling policies should be evaluated based not only on performance metrics that are of interest to the infrastructure side, such as the Grid resources utilization efficiency, but also on user satisfaction metrics, such as the percentage...
متن کاملA Dynamic Error Based Fair Scheduling Algorithm for a Computational Grid
Grid Computing has emerged as an important new field focusing on resource sharing. One of the most challenging issues in Grid Computing is efficient scheduling of tasks. In this paper, we propose a new algorithm for fair scheduling, and we compare it to other scheduling schemes such as the First Come First Served and the Round Robin schemes for a computational grid. It aims at addressing the fa...
متن کاملBicriteria Service Scheduling with Dynamic Instantiation for Workflow Execution on Grids
Nowadays the grid is turning into a service-oriented environment. In this context, there exist solutions to the execution of workflows and most of them are web-service based. Additionally, services are considered to exist on a fixed host, limiting the resource alternatives when scheduling the workflow tasks. In this paper we address the problem of dynamic instantiation of grid services to sched...
متن کامل